A Matroid Extension Result

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Matroid Generalization of a Result on Row-Latin Rectangles

Let A be an m n matrix in which the entries of each row are all distinct. Drisko 4] showed that, if m 2n ? 1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices with entries in a matroid. For such a matrix A, we show that if each row of A forms an independent set, then we can require the transversal to be independent as we...

متن کامل

An extension of a result of Lewis

A result of Lewis on the extreme properties of the inner product of two vectors in a Cartan subspace of a semisimple Lie algebra is extended. The framework used is an Eaton triple which has a reduced triple. Applications are made for determining the minimizers and maximizers of the distance function considered by Chu and Driessel with spectral constraint.

متن کامل

An extension result for continuous valuations

We show, by a simple and direct proof, that if a bounded valuation on a directed complete partial order (dcpo) is the supremum of a directed family of simple valuations then it has a unique extension to a measure on the Borel-algebra of the dcpo with the Scott topology. It follows that every bounded and continuous valuation on a continuous domain can be extended uniquely to a Borel measure. The...

متن کامل

Ela an Extension of a Result of Lewis

A result of Lewis on the extreme properties of the inner product of two v ectors in a Cartan subspace of a semisimple Lie algebra is extended. The framework used is an Eaton triple which has a reduced triple. Applications are made for determining the minimizers and maximizers of the distance function considered by C h u and Driessel with spectral constraint. 1. Main results. The purpose of this...

متن کامل

An extension of a result concerning convex geometric graphs

We show a general result known as the Erdos-Sos conjecture: if |E(G)| > 1 2 (k − 1)n where G has order n then G contains every tree of order k + 1 as a subgraph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2019

ISSN: 0895-4801,1095-7146

DOI: 10.1137/18m1187155